Computable Functions, Quantum Measurements, and Quantum Dynamics
نویسنده
چکیده
We construct quantum mechanical observables and unitary operators which, if implemented in physical systems as measurements and dynamical evolutions, would contradict the Church-Turing thesis which lies at the foundation of computer science. We conclude that either the Church-Turing thesis needs revision, or that only restricted classes of observables may be realized, in principle, as measurements, and that only restricted classes of unitary operators may be realized, in principle, as dynamics. [S0031-9007(97)04263-4]
منابع مشابه
Dynamics of entangled quantum optical system in independent media
We study the dynamics of two three-level atoms interacting with independent bosonic Lorentzian reservoirs at zero temperature. Such systems can be created in far astronomical objects. Quantum mechanical behaviour of these particles can produce detectable effects on the spectroscopic identifications of these objects, if such behaviour remain stable during the interaction with their media. It is ...
متن کاملDynamical evolution of nonclassical properties in cavity quantum electrodynamics with a single trapped ion
In this paper, by considering a system consisting of a single two-level trapped ion interacting with a single-mode quantized radiation field inside a lossless cavity, the temporal evolution of the ionic and the cavity-field quantum statistical properties including photon-counting statistics, quantum fluctuations of the field quadratures and quantum fluctuations of the ionic dipole variables are...
متن کاملBQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems
Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...
متن کاملQuantum Turing Machines Computations and Measurements
We propose a new formulation of Quantum Turing Machines, as an extension of those proposed by Bernstein and Vazirani. For this new class of Quantum Turing Machines, both finite and infinite computations are meaningful—an infinite computation does not correspond trivially to a divergent function. Moreover, we propose a natural observation protocol for the new QTMs, that does not modify the proba...
متن کاملComputing on Anonymous Quantum Network
This paper considers distributed computing on an anonymous quantum network, a network in which no party has a unique identifier and quantum communication and computation are available. It is proved that the leader election problem can exactly (i.e., without error in bounded time) be solved with at most the same complexity up to a constant factor as that of exactly computing symmetric functions ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997